<HTML>
<BODY BGCOLOR="white">
<PRE>
<FONT color="green">001</FONT>    /*<a name="line.1"></a>
<FONT color="green">002</FONT>     * Licensed to the Apache Software Foundation (ASF) under one or more<a name="line.2"></a>
<FONT color="green">003</FONT>     * contributor license agreements.  See the NOTICE file distributed with<a name="line.3"></a>
<FONT color="green">004</FONT>     * this work for additional information regarding copyright ownership.<a name="line.4"></a>
<FONT color="green">005</FONT>     * The ASF licenses this file to You under the Apache License, Version 2.0<a name="line.5"></a>
<FONT color="green">006</FONT>     * (the "License"); you may not use this file except in compliance with<a name="line.6"></a>
<FONT color="green">007</FONT>     * the License.  You may obtain a copy of the License at<a name="line.7"></a>
<FONT color="green">008</FONT>     *<a name="line.8"></a>
<FONT color="green">009</FONT>     *      http://www.apache.org/licenses/LICENSE-2.0<a name="line.9"></a>
<FONT color="green">010</FONT>     *<a name="line.10"></a>
<FONT color="green">011</FONT>     * Unless required by applicable law or agreed to in writing, software<a name="line.11"></a>
<FONT color="green">012</FONT>     * distributed under the License is distributed on an "AS IS" BASIS,<a name="line.12"></a>
<FONT color="green">013</FONT>     * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.<a name="line.13"></a>
<FONT color="green">014</FONT>     * See the License for the specific language governing permissions and<a name="line.14"></a>
<FONT color="green">015</FONT>     * limitations under the License.<a name="line.15"></a>
<FONT color="green">016</FONT>     */<a name="line.16"></a>
<FONT color="green">017</FONT>    <a name="line.17"></a>
<FONT color="green">018</FONT>    package org.apache.commons.math3.optim.nonlinear.scalar.noderiv;<a name="line.18"></a>
<FONT color="green">019</FONT>    <a name="line.19"></a>
<FONT color="green">020</FONT>    import java.util.Arrays;<a name="line.20"></a>
<FONT color="green">021</FONT>    import java.util.Comparator;<a name="line.21"></a>
<FONT color="green">022</FONT>    <a name="line.22"></a>
<FONT color="green">023</FONT>    import org.apache.commons.math3.analysis.MultivariateFunction;<a name="line.23"></a>
<FONT color="green">024</FONT>    import org.apache.commons.math3.exception.NotStrictlyPositiveException;<a name="line.24"></a>
<FONT color="green">025</FONT>    import org.apache.commons.math3.exception.DimensionMismatchException;<a name="line.25"></a>
<FONT color="green">026</FONT>    import org.apache.commons.math3.exception.ZeroException;<a name="line.26"></a>
<FONT color="green">027</FONT>    import org.apache.commons.math3.exception.OutOfRangeException;<a name="line.27"></a>
<FONT color="green">028</FONT>    import org.apache.commons.math3.exception.NullArgumentException;<a name="line.28"></a>
<FONT color="green">029</FONT>    import org.apache.commons.math3.exception.MathIllegalArgumentException;<a name="line.29"></a>
<FONT color="green">030</FONT>    import org.apache.commons.math3.exception.util.LocalizedFormats;<a name="line.30"></a>
<FONT color="green">031</FONT>    import org.apache.commons.math3.optim.PointValuePair;<a name="line.31"></a>
<FONT color="green">032</FONT>    import org.apache.commons.math3.optim.OptimizationData;<a name="line.32"></a>
<FONT color="green">033</FONT>    <a name="line.33"></a>
<FONT color="green">034</FONT>    /**<a name="line.34"></a>
<FONT color="green">035</FONT>     * This class implements the simplex concept.<a name="line.35"></a>
<FONT color="green">036</FONT>     * It is intended to be used in conjunction with {@link SimplexOptimizer}.<a name="line.36"></a>
<FONT color="green">037</FONT>     * &lt;br/&gt;<a name="line.37"></a>
<FONT color="green">038</FONT>     * The initial configuration of the simplex is set by the constructors<a name="line.38"></a>
<FONT color="green">039</FONT>     * {@link #AbstractSimplex(double[])} or {@link #AbstractSimplex(double[][])}.<a name="line.39"></a>
<FONT color="green">040</FONT>     * The other {@link #AbstractSimplex(int) constructor} will set all steps<a name="line.40"></a>
<FONT color="green">041</FONT>     * to 1, thus building a default configuration from a unit hypercube.<a name="line.41"></a>
<FONT color="green">042</FONT>     * &lt;br/&gt;<a name="line.42"></a>
<FONT color="green">043</FONT>     * Users &lt;em&gt;must&lt;/em&gt; call the {@link #build(double[]) build} method in order<a name="line.43"></a>
<FONT color="green">044</FONT>     * to create the data structure that will be acted on by the other methods of<a name="line.44"></a>
<FONT color="green">045</FONT>     * this class.<a name="line.45"></a>
<FONT color="green">046</FONT>     *<a name="line.46"></a>
<FONT color="green">047</FONT>     * @see SimplexOptimizer<a name="line.47"></a>
<FONT color="green">048</FONT>     * @version $Id: AbstractSimplex.java 1397759 2012-10-13 01:12:58Z erans $<a name="line.48"></a>
<FONT color="green">049</FONT>     * @since 3.0<a name="line.49"></a>
<FONT color="green">050</FONT>     */<a name="line.50"></a>
<FONT color="green">051</FONT>    public abstract class AbstractSimplex implements OptimizationData {<a name="line.51"></a>
<FONT color="green">052</FONT>        /** Simplex. */<a name="line.52"></a>
<FONT color="green">053</FONT>        private PointValuePair[] simplex;<a name="line.53"></a>
<FONT color="green">054</FONT>        /** Start simplex configuration. */<a name="line.54"></a>
<FONT color="green">055</FONT>        private double[][] startConfiguration;<a name="line.55"></a>
<FONT color="green">056</FONT>        /** Simplex dimension (must be equal to {@code simplex.length - 1}). */<a name="line.56"></a>
<FONT color="green">057</FONT>        private final int dimension;<a name="line.57"></a>
<FONT color="green">058</FONT>    <a name="line.58"></a>
<FONT color="green">059</FONT>        /**<a name="line.59"></a>
<FONT color="green">060</FONT>         * Build a unit hypercube simplex.<a name="line.60"></a>
<FONT color="green">061</FONT>         *<a name="line.61"></a>
<FONT color="green">062</FONT>         * @param n Dimension of the simplex.<a name="line.62"></a>
<FONT color="green">063</FONT>         */<a name="line.63"></a>
<FONT color="green">064</FONT>        protected AbstractSimplex(int n) {<a name="line.64"></a>
<FONT color="green">065</FONT>            this(n, 1d);<a name="line.65"></a>
<FONT color="green">066</FONT>        }<a name="line.66"></a>
<FONT color="green">067</FONT>    <a name="line.67"></a>
<FONT color="green">068</FONT>        /**<a name="line.68"></a>
<FONT color="green">069</FONT>         * Build a hypercube simplex with the given side length.<a name="line.69"></a>
<FONT color="green">070</FONT>         *<a name="line.70"></a>
<FONT color="green">071</FONT>         * @param n Dimension of the simplex.<a name="line.71"></a>
<FONT color="green">072</FONT>         * @param sideLength Length of the sides of the hypercube.<a name="line.72"></a>
<FONT color="green">073</FONT>         */<a name="line.73"></a>
<FONT color="green">074</FONT>        protected AbstractSimplex(int n,<a name="line.74"></a>
<FONT color="green">075</FONT>                                  double sideLength) {<a name="line.75"></a>
<FONT color="green">076</FONT>            this(createHypercubeSteps(n, sideLength));<a name="line.76"></a>
<FONT color="green">077</FONT>        }<a name="line.77"></a>
<FONT color="green">078</FONT>    <a name="line.78"></a>
<FONT color="green">079</FONT>        /**<a name="line.79"></a>
<FONT color="green">080</FONT>         * The start configuration for simplex is built from a box parallel to<a name="line.80"></a>
<FONT color="green">081</FONT>         * the canonical axes of the space. The simplex is the subset of vertices<a name="line.81"></a>
<FONT color="green">082</FONT>         * of a box parallel to the canonical axes. It is built as the path followed<a name="line.82"></a>
<FONT color="green">083</FONT>         * while traveling from one vertex of the box to the diagonally opposite<a name="line.83"></a>
<FONT color="green">084</FONT>         * vertex moving only along the box edges. The first vertex of the box will<a name="line.84"></a>
<FONT color="green">085</FONT>         * be located at the start point of the optimization.<a name="line.85"></a>
<FONT color="green">086</FONT>         * As an example, in dimension 3 a simplex has 4 vertices. Setting the<a name="line.86"></a>
<FONT color="green">087</FONT>         * steps to (1, 10, 2) and the start point to (1, 1, 1) would imply the<a name="line.87"></a>
<FONT color="green">088</FONT>         * start simplex would be: { (1, 1, 1), (2, 1, 1), (2, 11, 1), (2, 11, 3) }.<a name="line.88"></a>
<FONT color="green">089</FONT>         * The first vertex would be set to the start point at (1, 1, 1) and the<a name="line.89"></a>
<FONT color="green">090</FONT>         * last vertex would be set to the diagonally opposite vertex at (2, 11, 3).<a name="line.90"></a>
<FONT color="green">091</FONT>         *<a name="line.91"></a>
<FONT color="green">092</FONT>         * @param steps Steps along the canonical axes representing box edges. They<a name="line.92"></a>
<FONT color="green">093</FONT>         * may be negative but not zero.<a name="line.93"></a>
<FONT color="green">094</FONT>         * @throws NullArgumentException if {@code steps} is {@code null}.<a name="line.94"></a>
<FONT color="green">095</FONT>         * @throws ZeroException if one of the steps is zero.<a name="line.95"></a>
<FONT color="green">096</FONT>         */<a name="line.96"></a>
<FONT color="green">097</FONT>        protected AbstractSimplex(final double[] steps) {<a name="line.97"></a>
<FONT color="green">098</FONT>            if (steps == null) {<a name="line.98"></a>
<FONT color="green">099</FONT>                throw new NullArgumentException();<a name="line.99"></a>
<FONT color="green">100</FONT>            }<a name="line.100"></a>
<FONT color="green">101</FONT>            if (steps.length == 0) {<a name="line.101"></a>
<FONT color="green">102</FONT>                throw new ZeroException();<a name="line.102"></a>
<FONT color="green">103</FONT>            }<a name="line.103"></a>
<FONT color="green">104</FONT>            dimension = steps.length;<a name="line.104"></a>
<FONT color="green">105</FONT>    <a name="line.105"></a>
<FONT color="green">106</FONT>            // Only the relative position of the n final vertices with respect<a name="line.106"></a>
<FONT color="green">107</FONT>            // to the first one are stored.<a name="line.107"></a>
<FONT color="green">108</FONT>            startConfiguration = new double[dimension][dimension];<a name="line.108"></a>
<FONT color="green">109</FONT>            for (int i = 0; i &lt; dimension; i++) {<a name="line.109"></a>
<FONT color="green">110</FONT>                final double[] vertexI = startConfiguration[i];<a name="line.110"></a>
<FONT color="green">111</FONT>                for (int j = 0; j &lt; i + 1; j++) {<a name="line.111"></a>
<FONT color="green">112</FONT>                    if (steps[j] == 0) {<a name="line.112"></a>
<FONT color="green">113</FONT>                        throw new ZeroException(LocalizedFormats.EQUAL_VERTICES_IN_SIMPLEX);<a name="line.113"></a>
<FONT color="green">114</FONT>                    }<a name="line.114"></a>
<FONT color="green">115</FONT>                    System.arraycopy(steps, 0, vertexI, 0, j + 1);<a name="line.115"></a>
<FONT color="green">116</FONT>                }<a name="line.116"></a>
<FONT color="green">117</FONT>            }<a name="line.117"></a>
<FONT color="green">118</FONT>        }<a name="line.118"></a>
<FONT color="green">119</FONT>    <a name="line.119"></a>
<FONT color="green">120</FONT>        /**<a name="line.120"></a>
<FONT color="green">121</FONT>         * The real initial simplex will be set up by moving the reference<a name="line.121"></a>
<FONT color="green">122</FONT>         * simplex such that its first point is located at the start point of the<a name="line.122"></a>
<FONT color="green">123</FONT>         * optimization.<a name="line.123"></a>
<FONT color="green">124</FONT>         *<a name="line.124"></a>
<FONT color="green">125</FONT>         * @param referenceSimplex Reference simplex.<a name="line.125"></a>
<FONT color="green">126</FONT>         * @throws NotStrictlyPositiveException if the reference simplex does not<a name="line.126"></a>
<FONT color="green">127</FONT>         * contain at least one point.<a name="line.127"></a>
<FONT color="green">128</FONT>         * @throws DimensionMismatchException if there is a dimension mismatch<a name="line.128"></a>
<FONT color="green">129</FONT>         * in the reference simplex.<a name="line.129"></a>
<FONT color="green">130</FONT>         * @throws IllegalArgumentException if one of its vertices is duplicated.<a name="line.130"></a>
<FONT color="green">131</FONT>         */<a name="line.131"></a>
<FONT color="green">132</FONT>        protected AbstractSimplex(final double[][] referenceSimplex) {<a name="line.132"></a>
<FONT color="green">133</FONT>            if (referenceSimplex.length &lt;= 0) {<a name="line.133"></a>
<FONT color="green">134</FONT>                throw new NotStrictlyPositiveException(LocalizedFormats.SIMPLEX_NEED_ONE_POINT,<a name="line.134"></a>
<FONT color="green">135</FONT>                                                       referenceSimplex.length);<a name="line.135"></a>
<FONT color="green">136</FONT>            }<a name="line.136"></a>
<FONT color="green">137</FONT>            dimension = referenceSimplex.length - 1;<a name="line.137"></a>
<FONT color="green">138</FONT>    <a name="line.138"></a>
<FONT color="green">139</FONT>            // Only the relative position of the n final vertices with respect<a name="line.139"></a>
<FONT color="green">140</FONT>            // to the first one are stored.<a name="line.140"></a>
<FONT color="green">141</FONT>            startConfiguration = new double[dimension][dimension];<a name="line.141"></a>
<FONT color="green">142</FONT>            final double[] ref0 = referenceSimplex[0];<a name="line.142"></a>
<FONT color="green">143</FONT>    <a name="line.143"></a>
<FONT color="green">144</FONT>            // Loop over vertices.<a name="line.144"></a>
<FONT color="green">145</FONT>            for (int i = 0; i &lt; referenceSimplex.length; i++) {<a name="line.145"></a>
<FONT color="green">146</FONT>                final double[] refI = referenceSimplex[i];<a name="line.146"></a>
<FONT color="green">147</FONT>    <a name="line.147"></a>
<FONT color="green">148</FONT>                // Safety checks.<a name="line.148"></a>
<FONT color="green">149</FONT>                if (refI.length != dimension) {<a name="line.149"></a>
<FONT color="green">150</FONT>                    throw new DimensionMismatchException(refI.length, dimension);<a name="line.150"></a>
<FONT color="green">151</FONT>                }<a name="line.151"></a>
<FONT color="green">152</FONT>                for (int j = 0; j &lt; i; j++) {<a name="line.152"></a>
<FONT color="green">153</FONT>                    final double[] refJ = referenceSimplex[j];<a name="line.153"></a>
<FONT color="green">154</FONT>                    boolean allEquals = true;<a name="line.154"></a>
<FONT color="green">155</FONT>                    for (int k = 0; k &lt; dimension; k++) {<a name="line.155"></a>
<FONT color="green">156</FONT>                        if (refI[k] != refJ[k]) {<a name="line.156"></a>
<FONT color="green">157</FONT>                            allEquals = false;<a name="line.157"></a>
<FONT color="green">158</FONT>                            break;<a name="line.158"></a>
<FONT color="green">159</FONT>                        }<a name="line.159"></a>
<FONT color="green">160</FONT>                    }<a name="line.160"></a>
<FONT color="green">161</FONT>                    if (allEquals) {<a name="line.161"></a>
<FONT color="green">162</FONT>                        throw new MathIllegalArgumentException(LocalizedFormats.EQUAL_VERTICES_IN_SIMPLEX,<a name="line.162"></a>
<FONT color="green">163</FONT>                                                               i, j);<a name="line.163"></a>
<FONT color="green">164</FONT>                    }<a name="line.164"></a>
<FONT color="green">165</FONT>                }<a name="line.165"></a>
<FONT color="green">166</FONT>    <a name="line.166"></a>
<FONT color="green">167</FONT>                // Store vertex i position relative to vertex 0 position.<a name="line.167"></a>
<FONT color="green">168</FONT>                if (i &gt; 0) {<a name="line.168"></a>
<FONT color="green">169</FONT>                    final double[] confI = startConfiguration[i - 1];<a name="line.169"></a>
<FONT color="green">170</FONT>                    for (int k = 0; k &lt; dimension; k++) {<a name="line.170"></a>
<FONT color="green">171</FONT>                        confI[k] = refI[k] - ref0[k];<a name="line.171"></a>
<FONT color="green">172</FONT>                    }<a name="line.172"></a>
<FONT color="green">173</FONT>                }<a name="line.173"></a>
<FONT color="green">174</FONT>            }<a name="line.174"></a>
<FONT color="green">175</FONT>        }<a name="line.175"></a>
<FONT color="green">176</FONT>    <a name="line.176"></a>
<FONT color="green">177</FONT>        /**<a name="line.177"></a>
<FONT color="green">178</FONT>         * Get simplex dimension.<a name="line.178"></a>
<FONT color="green">179</FONT>         *<a name="line.179"></a>
<FONT color="green">180</FONT>         * @return the dimension of the simplex.<a name="line.180"></a>
<FONT color="green">181</FONT>         */<a name="line.181"></a>
<FONT color="green">182</FONT>        public int getDimension() {<a name="line.182"></a>
<FONT color="green">183</FONT>            return dimension;<a name="line.183"></a>
<FONT color="green">184</FONT>        }<a name="line.184"></a>
<FONT color="green">185</FONT>    <a name="line.185"></a>
<FONT color="green">186</FONT>        /**<a name="line.186"></a>
<FONT color="green">187</FONT>         * Get simplex size.<a name="line.187"></a>
<FONT color="green">188</FONT>         * After calling the {@link #build(double[]) build} method, this method will<a name="line.188"></a>
<FONT color="green">189</FONT>         * will be equivalent to {@code getDimension() + 1}.<a name="line.189"></a>
<FONT color="green">190</FONT>         *<a name="line.190"></a>
<FONT color="green">191</FONT>         * @return the size of the simplex.<a name="line.191"></a>
<FONT color="green">192</FONT>         */<a name="line.192"></a>
<FONT color="green">193</FONT>        public int getSize() {<a name="line.193"></a>
<FONT color="green">194</FONT>            return simplex.length;<a name="line.194"></a>
<FONT color="green">195</FONT>        }<a name="line.195"></a>
<FONT color="green">196</FONT>    <a name="line.196"></a>
<FONT color="green">197</FONT>        /**<a name="line.197"></a>
<FONT color="green">198</FONT>         * Compute the next simplex of the algorithm.<a name="line.198"></a>
<FONT color="green">199</FONT>         *<a name="line.199"></a>
<FONT color="green">200</FONT>         * @param evaluationFunction Evaluation function.<a name="line.200"></a>
<FONT color="green">201</FONT>         * @param comparator Comparator to use to sort simplex vertices from best<a name="line.201"></a>
<FONT color="green">202</FONT>         * to worst.<a name="line.202"></a>
<FONT color="green">203</FONT>         * @throws org.apache.commons.math3.exception.TooManyEvaluationsException<a name="line.203"></a>
<FONT color="green">204</FONT>         * if the algorithm fails to converge.<a name="line.204"></a>
<FONT color="green">205</FONT>         */<a name="line.205"></a>
<FONT color="green">206</FONT>        public abstract void iterate(final MultivariateFunction evaluationFunction,<a name="line.206"></a>
<FONT color="green">207</FONT>                                     final Comparator&lt;PointValuePair&gt; comparator);<a name="line.207"></a>
<FONT color="green">208</FONT>    <a name="line.208"></a>
<FONT color="green">209</FONT>        /**<a name="line.209"></a>
<FONT color="green">210</FONT>         * Build an initial simplex.<a name="line.210"></a>
<FONT color="green">211</FONT>         *<a name="line.211"></a>
<FONT color="green">212</FONT>         * @param startPoint First point of the simplex.<a name="line.212"></a>
<FONT color="green">213</FONT>         * @throws DimensionMismatchException if the start point does not match<a name="line.213"></a>
<FONT color="green">214</FONT>         * simplex dimension.<a name="line.214"></a>
<FONT color="green">215</FONT>         */<a name="line.215"></a>
<FONT color="green">216</FONT>        public void build(final double[] startPoint) {<a name="line.216"></a>
<FONT color="green">217</FONT>            if (dimension != startPoint.length) {<a name="line.217"></a>
<FONT color="green">218</FONT>                throw new DimensionMismatchException(dimension, startPoint.length);<a name="line.218"></a>
<FONT color="green">219</FONT>            }<a name="line.219"></a>
<FONT color="green">220</FONT>    <a name="line.220"></a>
<FONT color="green">221</FONT>            // Set first vertex.<a name="line.221"></a>
<FONT color="green">222</FONT>            simplex = new PointValuePair[dimension + 1];<a name="line.222"></a>
<FONT color="green">223</FONT>            simplex[0] = new PointValuePair(startPoint, Double.NaN);<a name="line.223"></a>
<FONT color="green">224</FONT>    <a name="line.224"></a>
<FONT color="green">225</FONT>            // Set remaining vertices.<a name="line.225"></a>
<FONT color="green">226</FONT>            for (int i = 0; i &lt; dimension; i++) {<a name="line.226"></a>
<FONT color="green">227</FONT>                final double[] confI = startConfiguration[i];<a name="line.227"></a>
<FONT color="green">228</FONT>                final double[] vertexI = new double[dimension];<a name="line.228"></a>
<FONT color="green">229</FONT>                for (int k = 0; k &lt; dimension; k++) {<a name="line.229"></a>
<FONT color="green">230</FONT>                    vertexI[k] = startPoint[k] + confI[k];<a name="line.230"></a>
<FONT color="green">231</FONT>                }<a name="line.231"></a>
<FONT color="green">232</FONT>                simplex[i + 1] = new PointValuePair(vertexI, Double.NaN);<a name="line.232"></a>
<FONT color="green">233</FONT>            }<a name="line.233"></a>
<FONT color="green">234</FONT>        }<a name="line.234"></a>
<FONT color="green">235</FONT>    <a name="line.235"></a>
<FONT color="green">236</FONT>        /**<a name="line.236"></a>
<FONT color="green">237</FONT>         * Evaluate all the non-evaluated points of the simplex.<a name="line.237"></a>
<FONT color="green">238</FONT>         *<a name="line.238"></a>
<FONT color="green">239</FONT>         * @param evaluationFunction Evaluation function.<a name="line.239"></a>
<FONT color="green">240</FONT>         * @param comparator Comparator to use to sort simplex vertices from best to worst.<a name="line.240"></a>
<FONT color="green">241</FONT>         * @throws org.apache.commons.math3.exception.TooManyEvaluationsException<a name="line.241"></a>
<FONT color="green">242</FONT>         * if the maximal number of evaluations is exceeded.<a name="line.242"></a>
<FONT color="green">243</FONT>         */<a name="line.243"></a>
<FONT color="green">244</FONT>        public void evaluate(final MultivariateFunction evaluationFunction,<a name="line.244"></a>
<FONT color="green">245</FONT>                             final Comparator&lt;PointValuePair&gt; comparator) {<a name="line.245"></a>
<FONT color="green">246</FONT>            // Evaluate the objective function at all non-evaluated simplex points.<a name="line.246"></a>
<FONT color="green">247</FONT>            for (int i = 0; i &lt; simplex.length; i++) {<a name="line.247"></a>
<FONT color="green">248</FONT>                final PointValuePair vertex = simplex[i];<a name="line.248"></a>
<FONT color="green">249</FONT>                final double[] point = vertex.getPointRef();<a name="line.249"></a>
<FONT color="green">250</FONT>                if (Double.isNaN(vertex.getValue())) {<a name="line.250"></a>
<FONT color="green">251</FONT>                    simplex[i] = new PointValuePair(point, evaluationFunction.value(point), false);<a name="line.251"></a>
<FONT color="green">252</FONT>                }<a name="line.252"></a>
<FONT color="green">253</FONT>            }<a name="line.253"></a>
<FONT color="green">254</FONT>    <a name="line.254"></a>
<FONT color="green">255</FONT>            // Sort the simplex from best to worst.<a name="line.255"></a>
<FONT color="green">256</FONT>            Arrays.sort(simplex, comparator);<a name="line.256"></a>
<FONT color="green">257</FONT>        }<a name="line.257"></a>
<FONT color="green">258</FONT>    <a name="line.258"></a>
<FONT color="green">259</FONT>        /**<a name="line.259"></a>
<FONT color="green">260</FONT>         * Replace the worst point of the simplex by a new point.<a name="line.260"></a>
<FONT color="green">261</FONT>         *<a name="line.261"></a>
<FONT color="green">262</FONT>         * @param pointValuePair Point to insert.<a name="line.262"></a>
<FONT color="green">263</FONT>         * @param comparator Comparator to use for sorting the simplex vertices<a name="line.263"></a>
<FONT color="green">264</FONT>         * from best to worst.<a name="line.264"></a>
<FONT color="green">265</FONT>         */<a name="line.265"></a>
<FONT color="green">266</FONT>        protected void replaceWorstPoint(PointValuePair pointValuePair,<a name="line.266"></a>
<FONT color="green">267</FONT>                                         final Comparator&lt;PointValuePair&gt; comparator) {<a name="line.267"></a>
<FONT color="green">268</FONT>            for (int i = 0; i &lt; dimension; i++) {<a name="line.268"></a>
<FONT color="green">269</FONT>                if (comparator.compare(simplex[i], pointValuePair) &gt; 0) {<a name="line.269"></a>
<FONT color="green">270</FONT>                    PointValuePair tmp = simplex[i];<a name="line.270"></a>
<FONT color="green">271</FONT>                    simplex[i] = pointValuePair;<a name="line.271"></a>
<FONT color="green">272</FONT>                    pointValuePair = tmp;<a name="line.272"></a>
<FONT color="green">273</FONT>                }<a name="line.273"></a>
<FONT color="green">274</FONT>            }<a name="line.274"></a>
<FONT color="green">275</FONT>            simplex[dimension] = pointValuePair;<a name="line.275"></a>
<FONT color="green">276</FONT>        }<a name="line.276"></a>
<FONT color="green">277</FONT>    <a name="line.277"></a>
<FONT color="green">278</FONT>        /**<a name="line.278"></a>
<FONT color="green">279</FONT>         * Get the points of the simplex.<a name="line.279"></a>
<FONT color="green">280</FONT>         *<a name="line.280"></a>
<FONT color="green">281</FONT>         * @return all the simplex points.<a name="line.281"></a>
<FONT color="green">282</FONT>         */<a name="line.282"></a>
<FONT color="green">283</FONT>        public PointValuePair[] getPoints() {<a name="line.283"></a>
<FONT color="green">284</FONT>            final PointValuePair[] copy = new PointValuePair[simplex.length];<a name="line.284"></a>
<FONT color="green">285</FONT>            System.arraycopy(simplex, 0, copy, 0, simplex.length);<a name="line.285"></a>
<FONT color="green">286</FONT>            return copy;<a name="line.286"></a>
<FONT color="green">287</FONT>        }<a name="line.287"></a>
<FONT color="green">288</FONT>    <a name="line.288"></a>
<FONT color="green">289</FONT>        /**<a name="line.289"></a>
<FONT color="green">290</FONT>         * Get the simplex point stored at the requested {@code index}.<a name="line.290"></a>
<FONT color="green">291</FONT>         *<a name="line.291"></a>
<FONT color="green">292</FONT>         * @param index Location.<a name="line.292"></a>
<FONT color="green">293</FONT>         * @return the point at location {@code index}.<a name="line.293"></a>
<FONT color="green">294</FONT>         */<a name="line.294"></a>
<FONT color="green">295</FONT>        public PointValuePair getPoint(int index) {<a name="line.295"></a>
<FONT color="green">296</FONT>            if (index &lt; 0 ||<a name="line.296"></a>
<FONT color="green">297</FONT>                index &gt;= simplex.length) {<a name="line.297"></a>
<FONT color="green">298</FONT>                throw new OutOfRangeException(index, 0, simplex.length - 1);<a name="line.298"></a>
<FONT color="green">299</FONT>            }<a name="line.299"></a>
<FONT color="green">300</FONT>            return simplex[index];<a name="line.300"></a>
<FONT color="green">301</FONT>        }<a name="line.301"></a>
<FONT color="green">302</FONT>    <a name="line.302"></a>
<FONT color="green">303</FONT>        /**<a name="line.303"></a>
<FONT color="green">304</FONT>         * Store a new point at location {@code index}.<a name="line.304"></a>
<FONT color="green">305</FONT>         * Note that no deep-copy of {@code point} is performed.<a name="line.305"></a>
<FONT color="green">306</FONT>         *<a name="line.306"></a>
<FONT color="green">307</FONT>         * @param index Location.<a name="line.307"></a>
<FONT color="green">308</FONT>         * @param point New value.<a name="line.308"></a>
<FONT color="green">309</FONT>         */<a name="line.309"></a>
<FONT color="green">310</FONT>        protected void setPoint(int index, PointValuePair point) {<a name="line.310"></a>
<FONT color="green">311</FONT>            if (index &lt; 0 ||<a name="line.311"></a>
<FONT color="green">312</FONT>                index &gt;= simplex.length) {<a name="line.312"></a>
<FONT color="green">313</FONT>                throw new OutOfRangeException(index, 0, simplex.length - 1);<a name="line.313"></a>
<FONT color="green">314</FONT>            }<a name="line.314"></a>
<FONT color="green">315</FONT>            simplex[index] = point;<a name="line.315"></a>
<FONT color="green">316</FONT>        }<a name="line.316"></a>
<FONT color="green">317</FONT>    <a name="line.317"></a>
<FONT color="green">318</FONT>        /**<a name="line.318"></a>
<FONT color="green">319</FONT>         * Replace all points.<a name="line.319"></a>
<FONT color="green">320</FONT>         * Note that no deep-copy of {@code points} is performed.<a name="line.320"></a>
<FONT color="green">321</FONT>         *<a name="line.321"></a>
<FONT color="green">322</FONT>         * @param points New Points.<a name="line.322"></a>
<FONT color="green">323</FONT>         */<a name="line.323"></a>
<FONT color="green">324</FONT>        protected void setPoints(PointValuePair[] points) {<a name="line.324"></a>
<FONT color="green">325</FONT>            if (points.length != simplex.length) {<a name="line.325"></a>
<FONT color="green">326</FONT>                throw new DimensionMismatchException(points.length, simplex.length);<a name="line.326"></a>
<FONT color="green">327</FONT>            }<a name="line.327"></a>
<FONT color="green">328</FONT>            simplex = points;<a name="line.328"></a>
<FONT color="green">329</FONT>        }<a name="line.329"></a>
<FONT color="green">330</FONT>    <a name="line.330"></a>
<FONT color="green">331</FONT>        /**<a name="line.331"></a>
<FONT color="green">332</FONT>         * Create steps for a unit hypercube.<a name="line.332"></a>
<FONT color="green">333</FONT>         *<a name="line.333"></a>
<FONT color="green">334</FONT>         * @param n Dimension of the hypercube.<a name="line.334"></a>
<FONT color="green">335</FONT>         * @param sideLength Length of the sides of the hypercube.<a name="line.335"></a>
<FONT color="green">336</FONT>         * @return the steps.<a name="line.336"></a>
<FONT color="green">337</FONT>         */<a name="line.337"></a>
<FONT color="green">338</FONT>        private static double[] createHypercubeSteps(int n,<a name="line.338"></a>
<FONT color="green">339</FONT>                                                     double sideLength) {<a name="line.339"></a>
<FONT color="green">340</FONT>            final double[] steps = new double[n];<a name="line.340"></a>
<FONT color="green">341</FONT>            for (int i = 0; i &lt; n; i++) {<a name="line.341"></a>
<FONT color="green">342</FONT>                steps[i] = sideLength;<a name="line.342"></a>
<FONT color="green">343</FONT>            }<a name="line.343"></a>
<FONT color="green">344</FONT>            return steps;<a name="line.344"></a>
<FONT color="green">345</FONT>        }<a name="line.345"></a>
<FONT color="green">346</FONT>    }<a name="line.346"></a>




























































</PRE>
</BODY>
</HTML>
